THE SHUFFLING BUFFER

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shuffling Chromosomes

The gene order of chromosomes can be rearranged by chromosomal inversions that reverse the order of segments. Motivated by a comparative study of two Drosophila species, we investigate the number of reversals that are needed to scramble the gene order when all reversals are equally likely and when the segments reversed are never more than L genes. In studying this question we prove some new res...

متن کامل

Shuffling Lattices

C. Greene (J. Combin. Theory Ser. A 47 (1988), 126-131) studied a family of lattices denoted ~K,,.,. In this paper, we generalize his work by defining a new operation on ordered pairs of lattices called shuffling. L1 shuffle L2 is denoted by L 1 M L2. The resulting L 1 M L 2 are not necessarily lattices but are posets. The lattices ~/U~, n correspond to the special cases N, ~ Nm. In this paper,...

متن کامل

Disk Shuffling

Starting from disk access traces obtained during normal system use of 4.2BSD-based file systems, we established a repeatable simulation environment across a range of workloads and disk types for comparing different shuffling algorithms. We explored several of these, including how often to make layout changes, how large a unit of data to shuffle, and some mechanisms to exploit sequentiality of r...

متن کامل

Shuffling with ordered cards

We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N = kq cards (where t ≥ 1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of their labels and add them to the shuffled stack. We show how to find stacks of cards invariant and periodic under the shuffling. We also show when gcd(q, k)...

متن کامل

Generalized domino-shuffling

The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph An, or more generally calculating the sum of the weights of all the matchings, where the weight of a matching is equal to the product of the (pre-assigned) weights of the constituent edges. This article presents eff...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Geometry & Applications

سال: 2001

ISSN: 0218-1959,1793-6357

DOI: 10.1142/s021819590100064x